The map below provides some suggestions on where new parkrun events should be started, in order to maximize (potential) public access. Select from the menu:
New candidates (first): Top 50 candidate parks to consider, if a single new parkrun event is to be started.New candidates (consecutive): Candidate parks for starting 25 consecutive events, taking into account the effects new events have on the effectiveness of subsequent events.Candidate parks: Shows all 2,827 parks that were considered.The objective function
\[ \min \limits_{c\ \in \ C } ( \sum_{i=1}^{32,844}{\min (f( \ l_i; \ E \cup c)^2 \ )} * w_i )\] The objective was to minimize the total population-weighted impedance. Distance \(d\) was assumed to have impedance \(d^2\) (access was assumed to be the inverse squared distance, in accordance with a classic gravity model. The set of established parkrun events was denoted as \(\ E = \{e_1 ,...,e_{451}\}\), the set of candidate parks as \(\ C = \{c_1 ,...,c_{2827}\}\), the total population living in LSOA \(l_i\) as \(w_i\), and the distance from LSOA \(l_i\) to the nearest parkrun event as \(min(f(l_i; E))\). More details are provided below.